Combining Propagation Information and Search Tree Visualization using ILOG OPL Studio
نویسندگان
چکیده
In this paper we give an overview of the current state of the graphical features provided by ILOG OPL Studio for debugging and performance tuning of OPL programs or external ILOG Solver based applications. This paper focuses on combining propagation and search information using the Search Tree view and the Propagation Spy. A new synthetic view is presented: the Christmas Tree, which combines the Search Tree view with statistics on the efficiency of the domain reduction and on the number of the propagation events triggered.
منابع مشابه
0 v 1 [ cs . P L ] 1 5 N ov 2 00 1 Combining Propagation Information and Search Tree Visualization using ILOG OPL Studio ∗
In this paper we give an overview of the current state of the graphical features provided by ILOG OPL Studio for debugging and performance tuning of OPL programs or external ILOG Solver based applications. This paper focuses on combining propagation and search information using the Search Tree view and the Propagation Spy. A new synthetic view is presented: the Christmas Tree, which combines th...
متن کاملNP Datalog: A logic language for expressing search and optimization problems
This paper presents a logic language for expressing NP search and optimization problems. Specifically, first a language obtained by extending (positive) DATALOG with intuitive and efficient constructs (namely, stratified negation, constraints and exclusive disjunction) is introduced. Next, a further restricted language only using a restricted form of disjunction to define (non-deterministically...
متن کاملA Comparison of Vishnu and Opl Studio
A reconfigurable scheduler is one that can be configured to solve a wide range of different scheduling problems without changing the software. Reconfigurable scheduling holds the promise of drastically reducing the cost of developing automated, optimized scheduling solutions and hence making optimized scheduling available for many real-world problems for which the cost has so far been prohibiti...
متن کاملOptimal Retail Order Fulfi
In this paper, we develop a linear optimization model for minimal cost fulfillment of goods in a business to customer (B2C) scenario. In particular, we focus on an Internet enabled retailer (e-tailer) fulfilling the orders received through the Web. We formulate and solve the least cost optimization problem to determine the best choice among the following three options: dedicated fulfillment, ou...
متن کاملSolving Frequency Assignment Problems with Constraint Programming
The topic of this diploma thesis is the solving of a Frequency Assignment Problem (FAP) in GSM radio networks by means of Constraint Programming. The task of frequency planning is the assignment of frequencies to base stations w.r.t. various constraints such that interference, which may have a substantial impact on the quality of the received signals, is avoided as far as possible. Constraint P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001